Formulating Connectedness in Security-Constrained Optimal Transmission Switching Problems

This paper focuses on the issue of network connectedness (NC) in security-constrained optimal transmission switching problems, which is complicated by branch contingencies and corrective line switching. Two criteria are firstly proposed with principle preserving NC as much possible within reasonable limits. By extending electrical flow based constraints, a proposition derived to associate different cases optimum linear program, yielding mathematical formulation criteria. Karush-Kuhn-Tucker conditions, this further transformed into tractable version can be incorporated existing SCOTS models without affecting applicability original solution approaches. Finally, case studies various networks demonstrate efficacy approach.